case studi financi ratio cross dgraph quasi dbicliqu bird bring flue mine frequent high weight cliqu bird migrat network neg correl collabor concept algorithm protein bind hot spot residu dresidu pair prefer water exclus perspect sequenc dbase identif interfac residu integr profil combin hydrophob evolutionari inform model protein interact group quasi dbicliqu complex discoveri migrat habitat rout wild bird speci cluster associ analysi high function coher dpartit protein cliqu protein interact network applic emerg pattern microarrai gene express data analysi emerg pattern base classif emerg pattern abstract emerg pattern ep associ featur frequenc increas significantli class proven build power classifi establish diagnosi huge search space mine repres ep hard task larg dataset recent result condens represent frequent close pattern propos exact condens represent ep give method provid ep highest growth rate call strong emerg pattern sep collabor philip compani experi show interest sep introduct character class classif signific field researchin data mine machin learn initi introduc emerg pattern ep pattern frequenc strongli vari data set class ep character class quantit qualit capac emphas distinct class ep enabl build classifi propos diagnosi mine ep larg dataset remain challeng highnumb candid pattern paper propos contribut effici extract ofemerg pattern origin approach advantag recent progress condens represent close pattern firstli propos exact condens represent emerg pattern dataset contrari border approach section epswith lower bound growth rate condens represent easili enabl exact growth rate emerg pattern wepropos method easili provid emerg pattern growth rate call amp quot strong emerg pattern amp quot work justifi byrequest provid data collabor philip compani notic practic high number ep strong emerg patternsar bring synthet exploit result doubl water exclus hypothesi refin dring theori hot spot protein interfac pad simpl effect pattern dawar dynam search method fast maxim frequent pattern mine effici mine distanc dbase subspac cluster neg gener border effect pattern mainten abstract paper studi mainten frequent pattern context gener represent gener represent concis lossless represent frequent pattern effect maintain gener represent systemat expand neg gener border literatur review prior work studi mainten gener represent illustr propos mainten idea algorithm develop maintain gener represent support threshold adjust experiment result show propos algorithm significantli faster state art algorithm propos mainten idea extend represent frequent pattern demonstr paper interact amino acid prefer pattern pair bind site transient oblig protein complex assess physico chemic characterist protein protein interact protein sequenc structur fold analyz previous highlight discoveri examin amino acid pattern bind site defin structur proxim dimension space essenti paper investig interact prefer pattern pair discov separ transient oblig protein complex pattern pair necessarili sequenc consecut residu group amino acid protein complex threshold residu group develop algorithm call aapair pair interact protein repres bipartit graph discov maxim quasi bicliqu bipartit graph form pattern pair highli conserv pattern pair discov transient oblig complex observ ala leu highest occur amino acid interact pattern transient oblig complex studi dipeptid composit side interact pattern pair dipeptid ala ala ala leu popular pattern transient oblig complex interact amino acid larg hydrophob differ present transient oblig complex contrari oblig complex interact hydrophob residu account top occur amino acid pair interact amino acid prefer pattern pair bind site transient oblig protein complex assess physico chemic characterist protein protein interact protein sequenc structur fold analyz previous highlight discoveri examin amino acid pattern bind site defin structur proxim dimension space essenti paper investig interact prefer pattern pair discov separ transient oblig protein complex pattern pair necessarili sequenc consecut residu group amino acid protein complex threshold residu group develop algorithm call aapair pair interact protein repres bipartit graph discov maxim quasi bicliqu bipartit graph form pattern pair highli conserv pattern pair discov transient oblig complex observ ala leu highest occur amino acid interact pattern transient oblig complex studi dipeptid composit side interact pattern pair dipeptid ala ala ala leu popular pattern transient oblig complex interact amino acid larg hydrophob differ present transient oblig complex contrari oblig complex interact hydrophob residu account top occur amino acid pair quasi dbicliqu complex bind pair mine rank gener sequenti pattern sequenti pattern mine propos agraw srikant receiv intens research due wide rang applic real life domain improv propos includ mine close set sequenti pattern sequenti pattern support sequenc databas consid belong equival class equival class pattern partial order sequenc relationship support equival class set maxim minim pattern refer close pattern gener gener close pattern provid addit inform close pattern provid gener minim member prefer close pattern model select classif base minimum descript length mdl principl algorithm propos mine close sequenti pattern mine sequenti gener paper fill research gap investig properti sequenti gener propos algorithm effici mine sequenti gener algorithm work step process search space compact gener prune final filter step introduc rank mine gener propos mine uniqu gener equival class perform studi conduct synthet real benchmark dataset show mine gener fast mine close pattern low support threshold maxim quasi dbicliqu balanc nois toler concept dcluster applic rigid versu adjac requir maxim bicliqu vertex set extrem vulner miss data past type quasi bicliqu propos tackl problem nois toler unbalanc skew paper improv nois toler maxim quasi bicliqu allow vertex toler number percentag miss edg idea lead natur interact vertex set balanc versu adjac gener trivial larg size maxim quasi bicliqu subgraph maxim bicliqu observ impli direct expans maxim bicliqu guarante complet enumer maxim quasi bicliqu present import properti maxim quasi bicliqu bound closur properti fix point properti design effici algorithm maxim quasi bicliqu close relat cluster problem document word cluster imag featur coclust stock financi ratio cluster demonstr us concept applic bioinformat predict true protein interact investig concis represent frequent itemset gener posit border complet set frequent itemset undesir larg due redund minimum support threshold low databas dens concis represent previous propos elimin redund gener base represent reli neg border make represent lossless number itemset neg border exce total number frequent itemset paper propos posit border frequent gener form lossless represent posit border order magnitud smaller neg border set frequent gener posit border larger complet set frequent itemset true concis represent gener form represent propos develop effici algorithm call grgrowth mine gener posit border gener grgrowth algorithm depth search strategi explor search space effici breadth search strategi adopt exist gener mine algorithm experi result show grgrowth algorithm significantli faster level wise algorithm mine gener base represent compar state art algorithm mine frequent close itemset emerg technolog knowledg discoveri data mine distanc base subspac cluster flexibl dimens partit mine statist import equival class delta ddiscrimin emerg pattern support confid framework common measur itemset mine algorithm antimonoton effect simplifi search lattic comput conveni bring qualiti statist flaw result observ previou studi paper introduc algorithm produc itemset rank statist merit sophist test statist chi squar risk ratio odd ratio algorithm base concept equival class equival class set frequent itemset occur set transact itemset equival class share level statist signific varieti test statist equival class uniqu determin concis repres close pattern set gener mine close pattern gener take simultan depth search scheme parallel approach exploit prior work evalu algorithm aspect gener compar lcm fpclose algorithm tailor mine close pattern compar epmin recent algorithm mine type rel risk pattern minim emerg pattern experiment result show algorithm faster multipl order magnitud faster statist rank pattern effici high potenti reallif applic biomed financi field classic test statist domin interest evolut mainten frequent pattern space transact remov abstract paper address mainten discov frequent pattern batch transact remov origin dataset conduct depth investig frequent pattern space evolv transact remov updat concept equival class inspir evolut analysi effect exact algorithm trum propos maintain frequent pattern trum maintain frequent pattern effici updat affect equival class experiment result demonstr algorithm outperform repres state art algorithm workshop biodm overview discov pattern dna methyl rule mine rough set decis tree maxim bicliqu subgraph close pattern pair adjac matrix dto correspond mine algorithm maxim bicliqu complet bipartit subgraph model applic web mine busi bioinformat enumer maxim bicliqu subgraph graph computation challeng problem size output exponenti larg respect vertex number graph grow paper effici enumer close pattern adjac matrix graph undirect graph loop prove number close pattern adjac matrix ii number close pattern precis doubl number maxim bicliqu subgraph iii maxim bicliqu subgraph exist uniqu pair close pattern match vertex set subgraph problem enumer maxim bicliqu solv effici algorithm mine close pattern algorithm extens studi data mine field direct exist algorithm duplic enumer achiev high effici propos mn time delai algorithm duplic enumer enumer maxim bicliqu larg size number edg vertic graph evalu high effici algorithm compar state art algorithm categori graph randomli gener graph benchmark real life protein interact network paper prove loop allow graph number close pattern adjac matrix necessarili maxim bicliqu graph remov loop strong compound drisk factor effici discoveri emerg pattern contrast set data mine biomed applic minimum descript length principl gener prefer close pattern minimum descript length principl gener prefer close pattern cow cluster web user base histor web session abstract cluster web user import research topic web usag mine exist approach cluster web user base snapshot web user session account dynam natur web usag data paper focu discov knowledg cluster web user base evolut histor web session present algorithm call cow cluster web user step set web user mine histori web session extract interest pattern captur characterist usag data evolut similar web user comput base common interest pattern desir cluster gener partit cluster techniqu web user cluster gener base histor web session intellig web advertis web cach effici mine larg maxim bicliqu maxim bicliqu complet bipartit subgraph model applic web mine busi bioinformat enumer maxim bicliqu subgraph graph computation challeng problem size output exponenti larg respect vertex number graph grow paper effici enumer close pattern adjac matrix graph undirect graph loop prove number close pattern adjac matrix ii number close pattern precis doubl number maxim bicliqu subgraph iii maxim bicliqu subgraph exist uniqu pair close pattern match vertex set subgraph problem enumer maxim bicliqu solv effici algorithm mine close pattern algorithm extens studi data mine field direct exist algorithm duplic enumer achiev high effici propos mn time delai algorithm duplic enumer enumer maxim bicliqu larg size number edg vertic graph evalu high effici algorithm compar state art algorithm categori graph randomli gener graph benchmark real life protein interact network paper prove loop allow graph number close pattern adjac matrix necessarili maxim bicliqu graph remov loop perform analysi mf dtdma multi dcarrier demultiplex fdemodul mcd presenc critic degrad factor mine tempor indirect associ bayesian approach rank sequenti pattern interesting posit border neg border make lossless gener base represent concis complet set frequent itemset undesir larg due redund represent propos elimin redund exist gener base represent reli neg border make represent lossless neg border gener larg number itemset neg border exce total number frequent itemset paper propos posit border frequent gener form lossless represent set frequent gener posit border larger complet set frequent itemset true concis represent gener form represent propos develop effici algorithm call grgrowth mine gener posit border gener discov motif pair interact site protein sequenc proteom dwide scale mine succinct system minim gener formal concept abstract formal concept analysi activ field studi data analysi knowledg discoveri formal concept determin extent set object fall intent set properti attribut cover intent call close itemset maximum set attribut character minim gener minim subset intent similarli character paper introduc succinct system minim gener ssmg minim represent minim gener concept effici algorithm mine ssmg ssmg reveal equival relationship minim gener import medic scientif discoveri reveal extent base semant equival associ ssmg losslessli reduc size represent minim gener similar close itemset losslessli reduc size represent frequent itemset remov redud human user grasp structur inform concept correspond maxim complet bipartit subgraph close pattern undirect graph loop prove number close pattern adjac matrix ii number close pattern precis doubl number maxim complet bipartit subgraph iii maxim complet bipartit subgraph exist uniqu distinct pair close pattern match vertex set subgraph effici enumer maxim complet bipartit subgraph algorithm mine close pattern extens studi data mine field rel risk odd ratio data mine perspect interest test effect natur factor involv test call model free studi major strategi demonstr associ risk factor pattern outcom phenotyp class label prospect studi design analysi base concept rel risk fraction expos pattern unexpos lack pattern individu phenotyp class label retrospect design analysi base concept odd ratio odd case expos risk factor compar odd case expos effici extract pattern good rel risk odd ratio previous studi data mine context paper investig pattern show pattern space systemat stratifi plateau convex space base support level exploit convex formul number sound complet algorithm extract gener specif pattern support level compar algorithm demonstr effici algorithm mine sophist pattern speed compar mine frequent close pattern pattern satisfi consider simpler condit extrem patient sampl outcom predict gene express data motiv patient outcom predict microarrai technolog import applic bioinformat base patient genotyp microarrai data predict made estim patient surviv time risk tumor metastasi recurr accur predict potenti provid treatment patient result present comput method patient outcom predict train phase method make type extrem patient sampl shortterm survivor unfavor outcom short period long term survivor maintain favor outcom long follow time extrem train sampl yield clear platform identifi relev gene express close relat outcom select extrem sampl relev gene integr support vector machin build predict model valid sampl assign risk score fall special pre defin risk group appli method public data set case patient high low risk group stratifi method distinguish outcom statu kaplan meier curv show idea select extrem patient sampl train effect improv predict accuraci gene select method contact dnafsmin web dbase softwar toolbox recogn type function site dna sequenc guest editor introduct data mine bioinformat mine border descript emerg pattern dataset pair paper present overview pattern cluster method statist pattern recognit perspect goal provid advic refer fundament concept access broad commun cluster practition present taxonomi cluster techniqu identifi cross cut theme recent advanc describ import applic cluster algorithm imag segment object recognit inform retriev fix point theorem model bind protein dprotein interact structur geographi space emerg pattern mine border descript emerg pattern dataset pair paper present overview pattern cluster method statist pattern recognit perspect goal provid advic refer fundament concept access broad commun cluster practition present taxonomi cluster techniqu identifi cross cut theme recent advanc describ import applic cluster algorithm imag segment object recognit inform retriev built din featur interpret high ddimension cancer diagnosi data select patient sampl gene outcom predict gene express profil clinic outcom data enabl monitor diseas progress predict patient surviv molecular level present comput method outcom predict idea inform subset origin train sampl subset consist short term survivor di short period long term survivor aliv long follow time extrem train sampl yield clear platform identifi gene express relat surviv find relev gene combin featur select method entropi measur wilcoxon rank sum test set sharp discrimin featur identifi select train sampl gene integr support vector machin build predict model valid sampl assign surviv relaps risk score draw kaplan meier surviv curv appli method data set diffus larg cell lymphoma dlbcl primari lung adenocarcinoma case patient high low risk group stratifi risk score distinguish compar risk score clinic factor intern prognost index score dlbcl analysi tumor stage inform lung adenocarcinoma result gene express profil combin carefulli chosen learn algorithm predict patient surviv diseas tree dbase approach discoveri diagnost biomark ovarian cancer twelv zinc dfinger gene human chromosom translat type protein frameshift discoveri bind motif pair protein complex structur data protein interact sequenc data twelv zinc dfinger gene human chromosom translat type protein frameshift increment mainten border space emerg pattern amino acid pattern accur predict translat initi site paper present silico method predict translat initi site cdna mrna sequenc method consist sequenti step step candid featur gener gram amino acid pattern step small number top rank featur select entropi base algorithm step classif model built recogn true tiss appli support vector machin ensembl decis tree select featur test method independ data set includ public extract sequenc experiment result achiev report previous data set high accuraci demonstr feasibl method amino acid motif ti cdna mrna sequenc featur space transform understand biolog medic classif deep instanc dbase lazi discoveri classif system featur space transform decis result interpret informat bioinformat informat help launch molecular biologi genom era appear informat continu major factor success molecular biologi post genom era paper describ advanc made data integr data mine technolog relev molecular biologi biomed scienc discuss past present research result topic tame autonom heterogen distribut data sourc predict immunogen peptid discoveri gene structur featur classif gene express profil extract protein interact inform literatur keyword bioinformat data integr data wareh kleisli epitop predict fimm transcript start site recognit dragon gene express analysi pcl protein interact extract pi dentropi discret featur effect classifi high ddimension biomed data abstract paper studi empir featur select heurist classifi high dimension bio medic data featur discrimin power measur entropi base idea featur entropi idea select reduc dimension data rank remain featur select featur entropi smaller averag remain featur entropi round select reduc third featur achiev reduct ten thousand featur hundr import featur observ learn algorithm includ tree committe classifi gener improv accuraci featur select heurist appear systemat prevail specif number top rank featur classif discoveri signific rule classifi cancer diagnosi data ensembl cascad tree introduc method call cs construct committe decis tree classif method consid top rank featur root node member tree idea suitabl deal high dimension bio medic data top rank featur type data possess similar merit classif make decis committe combin power individu tree weight manner unlik bag boost bootstrap train data method build member tree committe set train data test idea uci data set recent bio medic data set gene express proteom profil featur experiment result show method effici classif perform superior famili algorithm bioinformat adventur databas research informat help launch molecular biologi genom era appear informat remain major contributor molecular biologi post genom era discuss data integr datamin bioinformat role databas theori plai topic rule analys bio dmedic data comparison pcl easi comprehens rule preferr linear kernel function analysi bio medic data paper describ rule induct approach pcl classifi discov rule tradit clinic data recent gene express proteom profil data wide method weak singl coverag constraint fragment problem affect accuraci pcl rule base classifi overcom weak decis tree signific rule present comparison show pcl method accur superior bag boost gener simpl rule underli gene express profil subtyp acut lymphoblast leukemia patient solv fragment problem decis tree discov boundari emerg pattern geographi differ class data identifi good diagnost gene group gene express profil concept emerg pattern identifi good diagnost gene group gene express profil concept emerg pattern make express jump emerg pattern classif classif aim discov model train data predict class test instanc paper propos jump emerg pattern jep basi classifi call jep classifi jep captur crucial differ pair dataset aggreg jep larg support produc potent classif power procedur jep classifi learn pair wise featur set jep contain train data collect impact contribut express pair wise featur determin class label test data express jep jep classifi strengthen resist nois train data reduc complex larg number jep algorithm construct jep classifi scalabl effici algorithm make border emerg pattern classif space jump emerg pattern increment mainten algorithm concept jump emerg pattern jep propos describ discrimin featur occur posit train instanc occur neg class jep construct classifi gener provid accuraci state art classifi algorithm maintain space jump emerg pattern jep space present paper prove jep space satisfi properti convex jep space concis repres bound consist gener element specif element respons insert train instanc jep space modifi oper boundari element boundari element jep space instanc strategi complet avoid back initi step build jep space addit make express jump emerg pattern classif classif aim discov model train data predict class test instanc paper propos jump emerg pattern jep basi classifi call jep classifi jep captur crucial differ pair dataset aggreg jep larg support produc potent classif power procedur jep classifi learn pair wise featur set jep contain train data collect impact contribut express pair wise featur determin class label test data express jep jep classifi strengthen resist nois train data reduc complex larg number jep algorithm construct jep classifi scalabl effici algorithm make border instanc dbase classif emerg pattern emerg pattern ep itemset support chang significantli class captur discrimin featur sharpli contrast instanc class recent ep base classifi propos mine ep call eager learn train data aggreg discrimin power mine ep classifi instanc propos instanc base classifi ep call deep achiev accuraci effici previous propos ep base classifi high accuraci achiev instanc base approach enabl deep pinpoint ep relev test instanc miss eager learn approach high effici obtain seri data reduct concis data represent techniqu experi show deep decis time linearli scalabl number train instanc caep classif aggreg emerg pattern jinyan li effici mine emerg pattern discov trend differ introduc kind pattern call emerg pattern ep knowledg discoveri databas ep defin itemset support increas significantli dataset ep captur emerg trend timestamp databas contrast data class ep proven build power classifi accur cba dataset ep low medium support give insight guidanc expert understood applic effici mine ep challeng problem apriori properti longer hold ep ii candid high dimension databas small support threshold naiv algorithm costli solv problem promot descript larg collect itemset concis border pa effici mine high confidi associ rule support threshold interesting discov associ rule term neighborhood dbase unexpected central problem knowledg discoveri develop good measur interesting discov pattern measur user manual examin interest rule larg number mine rule previou propos measur includ rule templat minim rule cover action unexpected statist sens user belief paper introduc neighborhood base interesting unexpected term neighborhood base paramet present notion distanc rule neighborhood rule neighborhood base interesting rule defin term pattern fluctuat confid densiti mine rule neighborhood interesting defin set rule plateau ridg neighborhood properti 